منابع مشابه
An Ore-type Condition for Cyclability
Let G = (V (G), E(G)) be a finite simple graph without loops. The neighbourhood N (v) of a vertex v is the set of vertices adjacent to v. The degree d(v) of v is |N (v)|. The minimum and maximum degree of G are denoted by δ(G) and 1(G), respectively. For a vertex v ∈ V (G) and a subset S ⊆ V (G), NS(v) is the set of neighbours of v contained in S, i.e., NS(v) = N (v) ∩ S. We let dS(v) = |NS(v)|...
متن کاملA Fan-type condition for Hamiltonian graphs
For two non-adjacent vertices u: v in a graph G, we use a(u~ v) to denote the ma."\.imum cardinality of an independent vertex set of G containing both u and v. In this paper, we prove that if G is a 2-connected graph of order n and max{d{u),d(v}} ~ ~ for each pair of nonadjacent vertices Lt. v of G with 1 ::; IN( u) nN( v) I < a(u, v) -1, then either G is Hamiltonian or else G belongs to a fami...
متن کاملA Fan Type Condition For Heavy Cycles in Weighted Graphs
A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the weight of e. The weight of a cycle is the sum of the weights of its edges. The weighted degree d(v) of a vertex v is the sum of the weights of the edges incident with v. In this paper, we prove the following result: Suppose G is a 2-connected weighted graph which satisfies the following condition...
متن کاملA Fan-type degree condition for k-linked graphs
A graph G is k-linked if for any 2k vertices s1 . . . , sk, t1, . . . , tk in G, there exist disjoint paths Pi such that Pi is an si − ti path for 1 ≤ i ≤ k. Motivated by work of G. Fan, let σ∗ 2(G) denote the minimum degree sum of vertices at distance two in G. In this note, we prove that a graph G ∗ Research supported by the Mathematics Tianyuan Foundation of China under no. 11026162, SRF for...
متن کاملAn Implicit Degree Condition for Cyclability in Graphs
A vertex subset X of a graph G is said to be cyclable in G if there is a cycle in G containing all vertices of X. Ore [6] showed that the vertex set of G with cardinality n ≥ 3 is cyclable (i.e. G is hamiltonian) if the degree sum of any pair of nonadjacent vertices in G is at least n. Shi [8] and Ota [7] respectively generalized Ore’s result by considering the cyclability of any vertex subset ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.08.003